ax,ay=map(int,input().split())
a=set()
b=set()
for i in range(ay):
c,d=map(int,input().split())
a.add(c)
b.add(d)
print((ax-len(a))*(ax-len(b)), end = " ")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ii pair<ll,ll>
#define vi vector<int>
#define forn(i,n) for(int i = 0; i < int(n); i++)
#define forsn(i,s,n) for(int i = int(s); i < int(n); i++)
#define all(v) (v).begin(),(v).end()
#define FastIO ios_base::sync_with_stdio(false); cin.tie(NULL)
#define DBG(x) cerr << #x << " = " << (x) << endl
#define F first
#define S second
#define pb push_back
#define pf push_front
#define mp make_pair
#define el "\n"
int main() {
FastIO;
ll n,m;
cin >> n >> m;
map<ll, bool> cols;
map<ll, bool> rows;
ll r, c;
ll tot = n*n;
vector<ll> vec;
while(m--) {
bool rt = false, ct = false;
cin >> r >> c;
ll pos = (2*n)-1;
// DBG(pos);
if(rows.find(r) != rows.end()) {
pos -= n;
rt = true;
} else {
pos -= cols.size();
}
if(cols.find(c) != cols.end()) {
pos -= n;
ct = true;
} else {
pos-= rows.size();
}
if(rt and ct) {
pos = 0;
} else if(rt or ct) {
pos++;
}
rows[r] = true;
cols[c] = true;
// DBG(pos);
tot -= pos;
vec.pb(tot);
}
cout << vec[0];
for(ll i = 1; i < vec.size(); i++) {
cout << " " << vec[i];
}
cout << el;
return 0;
}
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |